a problem that admits of no easy solution

См. также в других словарях:

• metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… …   Universalium

• Differential geometry of surfaces — Carl Friedrich Gauss in 1828 In mathematics, the differential geometry of surfaces deals with smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives:… …   Wikipedia

• Sidgwick, Henry — Sidgwick C.A.J.Coady Unlike John Stuart Mill or Jeremy Bentham, Henry Sidgwick’s is hardly a household name in intellectual circles beyond the world of professional philosophy. His standing amongst many contemporary moral philosophers as possibly …   History of philosophy

• number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium

• The Thirteen Problems — infobox Book | name = The Thirteen Problems title orig = translator = image caption = Dust jacket illustration of the first UK edition author = Agatha Christie cover artist = Not known country = United Kingdom language = English series = genre =… …   Wikipedia

• 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

• Aperiodic tiling — are an aperiodic set of tiles, since they admit only non periodic tilings of the plane:] Any of the infinitely many tilings by the Penrose tiles is non periodic. More informally, many refer to the Penrose tilings as being aperiodic tilings , but… …   Wikipedia

• Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

• Quantum field theory — In quantum field theory (QFT) the forces between particles are mediated by other particles. For instance, the electromagnetic force between two electrons is caused by an exchange of photons. But quantum field theory applies to all fundamental… …   Wikipedia

• Michaelmas Term (play) — Contents 1 Characters 1.1 Characters in the Induction 2 Synopsis 3 References …   Wikipedia

• cell — cell1 cell like, adj. /sel/, n. 1. a small room, as in a convent or prison. 2. any of various small compartments or bounded areas forming part of a whole. 3. a small group acting as a unit within a larger organization: a local cell of the… …   Universalium